Rational relations having a rational trace on each finite intersection of rational relations
نویسندگان
چکیده
We consider the family of rational relations on words, i.e., relations recognized by multitape automata, which have rational trace on any finite intersection of rational relations. We prove that this family consists of finite unions of relations which are of two types: stars of tuples possibly with an extra prefix and suffix and relations with all but one singleton set components.
منابع مشابه
A Note on Join and Auto-Intersection of n-ary Rational Relations
A finite-state machine with n tapes describes a rational (or regular) relation on n strings. It is more expressive than a relational database table with n columns, which can only describe a finite relation. We describe some basic operations on n-ary rational relations and propose notation for them. (For generality we give the semiring-weighted case in which each tuple has a weight.) Unfortunate...
متن کاملGraph Logics with Rational Relations
We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such logics use conditions on paths expressed by regular languages and relations, but they often need to be extended by rational relations such as subword or subse...
متن کاملSynchronous Regular Relations and Morphological Analysis
We list the major properties of some important classes of subrational relations, mostly to make them easily accessible to computational linguists. We then argue that there are good linguistic reasons for using no class smaller than the class of synchronous regular relations for morphological analysis, and good mathematical reasons for using no class which is larger. 1 Below the Rational Relatio...
متن کاملSelected Operations, Algorithms, and Applications of n-Tape Weighted Finite-State Machines
A weighted finite-state machine with n tapes (n-WFSM) defines a rational relation on n strings. The paper recalls important operations on these relations, and an algorithm for their auto-intersection. Through a series of practical applications, it investigates the augmented descriptive power of n-WFSMs, w.r.t. classical 1and 2-WFSMs (acceptors and transducers). Some applications are not feasibl...
متن کاملA Decidable Instance of the Inclusion Problem for Rational Relations
We study an instance of the inclusion problem for rational relations over words. In this paper we show how to check if a one generator submonoid {w}∗ ⊆ (Σ∗) is included in the prefix closure of a rational relation R ⊆ (Σ∗) given by a multi-tape finite automaton.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 454 شماره
صفحات -
تاریخ انتشار 2012